Reliability Evaluation for Shuffle Exchange Interconnection Network
نویسندگان
چکیده
منابع مشابه
Reliability Evaluation and Routing Integration in Shuffle Exchange Omega Network
Multistage Interconnection Networks (MINs) are design to provide an effective communication in switching. Shuffle-exchange networks (SENs) have been widely considered as practical interconnection systems due to their size of it switching elements (SEs) and uncomplicated configuration. In this paper, the relationship between reliability performance and number of network size are compared in shuf...
متن کاملMultistage Interconnection Network Reliability
the input transitions at t = t 1 and t = f Z imply a pulse at the input port Il of the component. The mechanism is illustrated through an example presented subsequently. ns and the input signals at ports A and B. Although both of the input signals at A and B are logical 1 and 2 ns in width that is much larger than t p / h = 0.5 ns, the overlapping region where both inputs are high constitutes a...
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملOn The Shuffle-Exchange Permutation Network
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm with an upper bound of (5/8)n + O(n), where n is the length of the permutation. (This improves on a (9/8)n routing algorithm described earlier [5].) Thus, the diameter of SEPn is at most (5/8) n 2 + O(n). We also show th...
متن کاملInterpolation Between Bases and the Shuffle Exchange Network
Let u1 , ••• , u. and v1, ••• , v. be bases of a vector space (the interesting case, when the underlying field is finite). Then there exist vectors w1, ••• , w._ 1 such that every n consecutive vectors in the sequence u1 , ••• , u., w1 , ••• , w._ 1, v1, ••• , v. from a basis. Similar statements hold in structures other then vector spaces. The case of a free Boolean algebra is shown equivalent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2015
ISSN: 1877-0509
DOI: 10.1016/j.procs.2015.07.533